An Optimized DiscretizationApproach using k-Means Bat Algorithm
نویسندگان
چکیده
منابع مشابه
An Optimized k-means Algorithm for Selecting Initial Clustering Centers
Selecting the initial clustering centers randomly will cause an instability final result, and make it easy to fall into local minimum. To improve the shortcoming of the existing kmeans clustering center selection algorithm, an optimized k-means algorithm for selecting initial clustering centers is proposed in this paper. When the number of the sample’s maximum density parameter value is not uni...
متن کاملPersistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm
Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...
متن کاملDesigning an Algorithm for Cancerous Tissue Segmentation Using Adaptive K-means Cluttering and Discrete Wavelet Transform
Background: Breast cancer is currently one of the leading causes of death among women worldwide. The diagnosis and separation of cancerous tumors in mammographic imagesrequire accuracy, experience and time, and it has always posed itself as a major challenge to the radiologists and physicians. Objective: This paper proposes a new algorithm which draws on discrete wavelet transform and adaptive ...
متن کاملK-Medoids Clustering Technique using Bat Algorithm
Clustering is one of the data analysis methods that are widely used in data mining. In this method, we partitioned the data into different subset which is known as cluster. Cluster analysis is the data reduction toll for classifying a “mountain‟ of information into manageable meaningful piles. This method is vast research area in the field of data mining. In this paper, a partitioning clusterin...
متن کاملK+ Means : An Enhancement Over K-Means Clustering Algorithm
K-means (MacQueen, 1967) [1] is one of the simplest unsupervised learning algorithms that solve the well-known clustering problem. The procedure follows a simple and easy way to classify a given data set to a predefined, say K number of clusters. Determination of K is a difficult job and it is not known that which value of K can partition the objects as per our intuition. To overcome this probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Turkish Journal of Computer and Mathematics Education (TURCOMAT)
سال: 2021
ISSN: 1309-4653
DOI: 10.17762/turcomat.v12i3.1013